/*
 * Anything: A flexible and easy to use data structure that combines the 
 * characteristics of a list and a hashmap into one data structure.
 * 
 * Based on a paper by Peter Sommerlad and Marcel Rueedi on 
 * 'Do-it-yourself reflection' entered at EuroPLOP 1998.
 * 
 * This library was written completely from scratch and is based only 
 * in spirit on the original Java Anything implementation written by 
 * Andre Weinand/Marcel Rueedi in 1997/99 and enhanced by Stefan Tramm 
 * in 2006.
 * 
 * Copyright (c) 2008 Thomas Marti and others. All rights reserved.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *   http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package any;

import java.util.Stack;


public class StatsVisitor implements AnyVisitor<SequentialAny> {

	private final Stack<Integer> shift = new Stack<Integer>();

	private int maxDepth = 0;

	private int maxSize = 0;
	
    public boolean beginVisit(String key, int index, SequentialAny any) {
		shift.push(0);
		maxDepth = Math.max(maxDepth, shift.size());
	    return true;
    }

	public boolean visit(String key, int index, SequentialAny any) {
		int size = shift.pop() + 1;
		shift.push(size);
		maxSize = Math.max(maxSize, size);
		return true;
	}
	
    public boolean endVisit(String key, int index, SequentialAny any) {
		shift.pop();
	    return true;
    }

	@Override
    public String toString() {
	    return "maxDepth = " + maxDepth + " / maxSize = " + maxSize;
	}
	
}
